Informational cost and networks navigability

نویسندگان

چکیده

Understanding how information navigates through nodes of a complex network has become an increasingly pressing problem across scientific disciplines. Several approaches have been proposed on the basis shortest paths or diffusive navigation. However, no existing tackled challenges efficient communication in networks without full knowledge their global topology under external noise. Here, we develop first principles approach and mathematical formalism to determine informational cost navigating different levels Using this discover existence trade-off between ways which route paths, entropies stability, define three classes real-world networks. This reveals that environmental pressure shaped is transferred bacterial metabolic allowed us noise at protein–protein interaction seems work normal conditions cell.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Navigability of Complex Networks

Routing information through networks is a universal phenomenon in both natural and manmade complex systems. When each node has full knowledge of the global network connectivity, finding short communication paths is merely a matter of distributed computation. However, in many real networks nodes communicate efficiently even without such global intelligence. Here we show that the peculiar structu...

متن کامل

Informational cost in correlation-based neuronal networks

The cost of maintaining a given level of activity in a neuronal network depends on its size and degree of connectivity. Should a neural function require large-size fully-connected networks, the cost can easily exceed metabolic resources, especially for high level neural functions. We show that, even in this case, the cost can still match the energetic resources provided the function is broken d...

متن کامل

Measuring the Navigability of Document Networks

Browsing by similarity is a search tactic familiar to most people but one that the web unevenly supports. We are interested in user interface tools that augment the web with links to help users navigate from one relevant document to other relevant documents. We propose a combination of simple metrics to measure the navigability of document networks. These measures provide for low cost evaluatio...

متن کامل

Navigability of interconnected networks under random failures.

Assessing the navigability of interconnected networks (transporting information, people, or goods) under eventual random failures is of utmost importance to design and protect critical infrastructures. Random walks are a good proxy to determine this navigability, specifically the coverage time of random walks, which is a measure of the dynamical functionality of the network. Here, we introduce ...

متن کامل

Self-organized Emergence of Navigability on Small-World Networks

This paper mainly investigates why small-world networks are navigable and how to navigate small-world networks. We find that the navigability can naturally emerge from self-organization in the absence of prior knowledge about underlying reference frames of networks. Through a process of information exchange and accumulation on networks, a hidden metric space for navigation on networks is constr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics and Computation

سال: 2021

ISSN: ['1873-5649', '0096-3003']

DOI: https://doi.org/10.1016/j.amc.2020.125914